a generalized kernel-based random k-samplesets method for transfer learning
نویسندگان
چکیده
transfer learning allows the knowledge transference from the source (training dataset) to target (test dataset) domain. feature selection for transfer learning (f-mmd) is a simple and effective transfer learning method, which tackles the domain shift problem. f-mmd has good performance on small-sized datasets, but it suffers from two major issues: i) computational efficiency and predictive performance of f-mmd is challenged by the application domains with large number of examples and features, and ii) f-mmd considers the domain shift problem in fully unsupervised manner. in this paper, we propose a new approach to break down the large initial set of samples into a number of small-sized random subsets, called samplesets. moreover, we present a feature weighting and instance clustering approach, which categorizes the original feature samplesets into the variant and invariant features. in domain shift problem, invariant features have a vital role in transferring knowledge across domains. the proposed method is called raket (random k samplesets), where k is a parameter that determines the size of the samplesets. empirical evidence indicates that raket manages to improve substantially over f-mmd, especially in domains with large number of features and examples. we evaluate raket against other well-known transfer learning methods on synthetic and real world datasets.
منابع مشابه
Reproducing Kernel Space Hilbert Method for Solving Generalized Burgers Equation
In this paper, we present a new method for solving Reproducing Kernel Space (RKS) theory, and iterative algorithm for solving Generalized Burgers Equation (GBE) is presented. The analytical solution is shown in a series in a RKS, and the approximate solution u(x,t) is constructed by truncating the series. The convergence of u(x,t) to the analytical solution is also proved.
متن کاملLow-rank decomposition meets kernel learning: A generalized Nyström method
Article history: Received 2 March 2016 Received in revised form 30 April 2017 Accepted 9 May 2017 Available online 15 May 2017
متن کاملKernel Penalized K-means: A feature selection method based on Kernel K-means
Article history: Received 11 June 2014 Received in revised form 23 October 2014 Accepted 11 June 2015 Available online 19 June 2015
متن کاملGeneralized hierarchical kernel learning
This paper generalizes the framework of Hierarchical Kernel Learning (HKL) and illustrates its utility in the domain of rule learning. HKL involves Multiple Kernel Learning over a set of given base kernels assumed to be embedded on a directed acyclic graph. This paper proposes a two-fold generalization of HKL: the first is employing a generic `1/`ρ block-norm regularizer (ρ ∈ (1, 2]) that allev...
متن کاملUnibucKernel: A kernel-based learning method for complex word identification
In this paper, we present a kernel-based learning approach for the 2018 Complex Word Identification (CWI) Shared Task. Our approach is based on combining multiple lowlevel features, such as character n-grams, with high-level semantic features that are either automatically learned using word embeddings or extracted from a lexical knowledge base, namely WordNet. After feature extraction, we emplo...
متن کاملA DNA-Based Random Walk Method for Solving k-SAT
This paper presents implementation of a concurrent version of Schöning’s algorithm for k-SAT (Proceedings of 40th Symposium on Foundations of Computer Science, pages 410–414. IEEE Computer Society Press, Los Alamitos, CA, 1999). It is shown that the algorithm can be implemented with space complexity O((2− 2 k ) ) and time complexity O(mn), where n is the number of variables and m is that of cla...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
iranian journal of science and technology transactions of electrical engineeringناشر: shiraz university
ISSN 2228-6179
دوره 39
شماره E2 2015
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023